// 
// Copyright (c) 2006-2008 Ben Motmans
// 
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
//
// Author(s):
//    Ben Motmans <ben.motmans@gmail.com>
//

using System;
using System.Collections.Generic;

namespace Anculus.Core
{
	//see http://msdn2.microsoft.com/en-us/library/w4e7fxsh.aspx for the fancy binary search complement
	public sealed class SortedInserter : AbstractInserter
	{
		public override int Insert<T> (List<T> list, IComparer<T> comparer, T item)
		{
			if (list == null)
				throw new ArgumentNullException ("list");
			if (comparer == null)
				throw new ArgumentNullException ("comparer");
			
			int index = list.BinarySearch (item, comparer);
			if (index < 0)
				index = (-index)-1;

			list.Insert (index, item);
			return index;
		}

		public override int Insert<T> (ref T[] array, IComparer<T> comparer, T item)
		{
			if (array == null)
				throw new ArgumentNullException ("array");
			if (comparer == null)
				throw new ArgumentNullException ("comparer");
			
			int index = Array.BinarySearch (array, item, comparer);
			if (index < 0)
				index = (-index)-1;
			
			Insert<T> (ref array, index, item);
			return index;
		}
	}
}
